NETASPNO: Approximate Strict Pattern Matching Under Nonoverlapping Condition
نویسندگان
چکیده
منابع مشابه
Approximate Geometric Pattern Matching Under Rigid Motions
We present techniques for matching point-sets in two and three dimensions under rigid-body transformations. We prove bounds on the worst-case performance of these algorithms to be within a small constant factor of optimal, and conduct experiments to show that the average performance of these matching algorithms is often better than that predicted by the worst-case bounds.
متن کاملWeighted Degenerated Approximate Pattern Matching
We present a bit-parallel approach to degenerated approximate pattern matching problem. That is the problem of finding approximate matches of a “special” pattern in a text of degenerate symbols. The special pattern P = s1 ∗ (a1,b1) . . . sl ∗ (al,bl) sl+1 ∗ (al+1,bl+1) . . . sω, such that symbol ∗ (a,b) is a sequence of at most b but at least a “don’t care” symbols which match any symbol within...
متن کاملApproximate Pattern Matching with Samples
We simplify in this paper the algorithm by Chang and Lawler for the approximate string matching problem, by adopting the concept of sampling. We have a more general analysis of expected time with the simpli ed algorithm for the one-dimensional case under a non-uniform probability distribution, and we show that our method can easily be generalized to the two-dimensional approximate pattern match...
متن کاملApproximate Pattern Matching in Nanotechnology
Approximate pattern matching is comparing an unknown pattern with a database of stored patterns with a specified error tolerance. This ability to compensate for real world sensor errors makes approximate pattern matching an ideal choice for a wide range of applications including fingerprint, picture and bar-code identification, industrial automation, robotics and bioinformatics. This paper show...
متن کاملAdaptive Approximate Record Matching
Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record Matching is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record Matching is proposed that can be adapted automatically with input error...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2018.2832209